package com.demo.study.algorithm.leetcode;

import org.junit.Test;

/**
 * LT1672
 * <a href="https://leetcode.cn/problems/richest-customer-wealth/description/">最富有客户的资产总量</a>
 *
 * @author Baymax
 * @since 2024-11-15
 */
public class LT1672 {
    @Test
    public void run() {

    }

    public int maximumWealth(int[][] accounts) {
        int max = 0;
        for (int[] account : accounts) {
            int curTotal = 0;
            for (int num : account) {
                curTotal += num;
            }
            max = Math.max(max, curTotal);
        }
        return max;
    }
}
